On the Use of Advanced Logic Programming Languages in Computational Linguistics

نویسندگان

  • Solange Coupet-Grimal
  • Olivier Ridoux
چکیده

Computational Linguistics and Logic Programming have strong connections , but the former uses concepts that are absent from the most familiar implementations of the latter. We advocate that a Logic Programming language need not feature the Computational Linguistics concepts exactly, it must only provide a logical way of dealing with them. We focus on the manipulation of higher-order terms and the logical handling of context, and we show that the advanced features of Prolog II and Prolog are useful for dealing with these concepts. Higher-order terms are native in Prolog, and Prolog II's innnite trees provide a handy data-structure for manipulating them. The formula language of Prolog can be transposed in the Logic Grammar realm to allow for a logical handling of context.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Use of Advanced Logic Programming Languages in Computational Linguistics Solange Coupet-grimal Et Olivier Ridoux

Computational Linguistics and Logic Programming have strong connections, but the former uses concepts that are absent from the most familiar implementations of the latter. We advocate that a Logic Programming language needs not feature the Computational Linguistics concepts exactly, it must only provide a logical way of dealing with them. We focus on the manipulation of higher-order terms and t...

متن کامل

Restricting Logic Grammars with Government-Binding Theory

A parser formalism for natural languages that is so restricted as to rule out the definition of linguistic structures that do not occur in any natural language can make the task of grammar construction easier, whether it is done manually (by a programmer) or automatically (by a grammar induction system). A restrictive grammar formalism for logic programming languages is presented that imposes s...

متن کامل

Live Graphical Computing Logic, Virtual Trees, and Visualization

The paper is a preliminary overview to a virtual tree computing logic with applications to Virtual Reality. Meta-contextual logic is combined with Morph Gentzen, a new computing logic the author presented in 1997. It has applications towards Virtual RealityVR computing since the trees on the languages can carry visual structures via functions. Designated functions define agents, as specific fun...

متن کامل

LFP A Logic for Linguistic Descriptions and an Analysis of its Complexity

We investigate the weak expressive power of a notation using first-order logic, augmented with a facility for recursion, to give linguistic descriptions. The notation is precise and easy to read, using ordinary conventions of logic. Two versions of the notation are presented. One, called CLFP, speaks about strings and concatenation, and generates the class EXPTIME of languages accepted by Turin...

متن کامل

Some Uses of Higher - Order Logicin Computational

Consideration of the question of meaning in the framework of linguistics often requires an allusion to sets and other higher-order notions. The traditional approach to representing and reasoning about meaning in a computational setting has been to use knowledge representation systems that are either based on rst-order logic or that use mechanisms whose formal justiications are to be provided af...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Log. Program.

دوره 24  شماره 

صفحات  -

تاریخ انتشار 1995